A High-Low Kolmogorov Complexity Law Equivalent to the 0-1 Law
نویسنده
چکیده
It is shown that the 0-1 Law for recursive logics on nite structures admits an equivalent formulation in terms of Kolmogorov complexity. The new formulation opens the possibility of using the Kolmogorov complexity apparatus to easily derive various properties for nite structures satisfying a given properties. Examples that illustrate this point are provided.
منابع مشابه
Extracting Kolmogorov Complexity with Applications to Dimension Zero-One Laws
We apply results on extracting randomness from independent sources to “extract” Kolmogorov complexity. For any α, > 0, given a string x with K(x) > α|x|, we show how to use a constant number of advice bits to efficiently compute another string y, |y| = Ω(|x|), with K(y) > (1− )|y|. This result holds for both unbounded and space-bounded Kolmogorov complexity. We use the extraction procedure for ...
متن کاملar X iv : c s . SE / 0 50 80 23 v 3 2 O ct 2 00 5 Software Libraries and Their Reuse : Entropy , Kolmogorov Complexity , and Zipf ’ s Law
We analyze software reuse from the perspective of information theory and Kolmogorov complexity, assessing our ability to “compress” programs by expressing them in terms of software components reused from libraries. A common theme in the software reuse literature is that if we can only get the right environment in place— the right tools, the right generalizations, economic incentives, a “culture...
متن کاملSoftware Libraries and Their Reuse: Entropy, Kolmogorov Complexity, and Zipf's Law
We analyze software reuse from the perspective of information theory and Kolmogorov complexity, assessing our ability to “compress” programs by expressing them in terms of software components reused from libraries. A common theme in the software reuse literature is that if we can only get the right environment in place— the right tools, the right generalizations, economic incentives, a “culture...
متن کاملMartin-ll of Tests Can Help Too
We argue that Martin-LL of tests provide useful techniques in proofs involving Kolmogorov complexity. Our examples cover more areas: (1) logical deenability; we prove an analogue of the 0-1 Law for various logics in terms of structures with high Kolmogorov complexity, (2) probabilistic computation: we display a relation between the Kolmogorov complexity of the random strings on which a probabil...
متن کاملZipf's law and L. Levin's probability distributions
Zipf’s law in its basic incarnation is an empirical probability distribution governing the frequency of usage of words in a language. As Terence Tao recently remarked, it still lacks a convincing and satisfactory mathematical explanation. In this paper I suggest that at least in certain situations, Zipf’s law can be explained as a special case of the a priori distribution introduced and studied...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Inf. Process. Lett.
دوره 57 شماره
صفحات -
تاریخ انتشار 1996